ans = 0
b = []
n, k = map(int,input().split())
a = sorted(list(map(int,input().split())), reverse=True)
for i in range(n):
if len(b)==k:
ans += (max(b)-1)*2
b = [a[i]]
else:
b.append(a[i])
ans += (max(b) - 1) * 2
print(ans)
#include <bits/stdc++.h>
using namespace std;
int n, k, a[2000], ans = 0;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
sort(a, a+n);
for (int i = n-1; i >= 0; i -= k)
{
int cnt = 0;
for (int j = 0; j < k && i - j >= 0; j++)
{
cnt = max(cnt, a[i - j]-1);
}
ans += cnt;
}
cout << ans*2;
return 0;
}152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |